merge(x, nil) → x
merge(nil, y) → y
merge(++(x, y), ++(u, v)) → ++(x, merge(y, ++(u, v)))
merge(++(x, y), ++(u, v)) → ++(u, merge(++(x, y), v))
↳ QTRS
↳ DependencyPairsProof
merge(x, nil) → x
merge(nil, y) → y
merge(++(x, y), ++(u, v)) → ++(x, merge(y, ++(u, v)))
merge(++(x, y), ++(u, v)) → ++(u, merge(++(x, y), v))
MERGE(++(x, y), ++(u, v)) → MERGE(++(x, y), v)
MERGE(++(x, y), ++(u, v)) → MERGE(y, ++(u, v))
merge(x, nil) → x
merge(nil, y) → y
merge(++(x, y), ++(u, v)) → ++(x, merge(y, ++(u, v)))
merge(++(x, y), ++(u, v)) → ++(u, merge(++(x, y), v))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
MERGE(++(x, y), ++(u, v)) → MERGE(++(x, y), v)
MERGE(++(x, y), ++(u, v)) → MERGE(y, ++(u, v))
merge(x, nil) → x
merge(nil, y) → y
merge(++(x, y), ++(u, v)) → ++(x, merge(y, ++(u, v)))
merge(++(x, y), ++(u, v)) → ++(u, merge(++(x, y), v))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
MERGE(++(x, y), ++(u, v)) → MERGE(y, ++(u, v))
merge(x, nil) → x
merge(nil, y) → y
merge(++(x, y), ++(u, v)) → ++(x, merge(y, ++(u, v)))
merge(++(x, y), ++(u, v)) → ++(u, merge(++(x, y), v))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MERGE(++(x, y), ++(u, v)) → MERGE(y, ++(u, v))
The value of delta used in the strict ordering is 1.
POL(++(x1, x2)) = 1/4 + (4)x_2
POL(v) = 0
POL(MERGE(x1, x2)) = (4)x_1
POL(u) = 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
merge(x, nil) → x
merge(nil, y) → y
merge(++(x, y), ++(u, v)) → ++(x, merge(y, ++(u, v)))
merge(++(x, y), ++(u, v)) → ++(u, merge(++(x, y), v))